Singleton Arc Consistency Revised
نویسندگان
چکیده
Consistency techniques make a main flavour of most constraint satisfaction algorithms. Their goal is to remove as many as possible inconsistencies from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus it achieves even better domain pruning. The paper presents a new algorithm for singleton arc consistency and discusses some implementation details. The proposed algorithm improves practical time efficiency of singleton arc consistency by applying the principles behind AC-4.
منابع مشابه
A New Algorithm for Singleton Arc Consistency
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search space by removing as many as possible inconsistent values from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus ...
متن کاملOn Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ...
متن کاملA Greedy Approach to Establish Singleton Arc Consistency
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملTheoretical Analysis of Singleton Arc Consistency
Singleton arc consistency (SAC) is a local consistency that enhances the pruning capability of arc consistency by ensuring that the network can be made arc consistent after any assignment of a value to a variable. While some algorithms have been proposed in the literature to enforce SAC, a more in-depth theoretical analysis of this local consistency has never been published. In this paper, we g...
متن کاملAdaptive Singleton-Based Consistencies
Singleton-based consistencies have been shown to dramatically improve the performance of constraint solvers on some difficult instances. However, they are in general too expensive to be applied exhaustively during the whole search. In this paper, we focus on partition-oneAC, a singleton-based consistency which, as opposed to singleton arc consistency, is able to prune values on all variables wh...
متن کامل